Computation of certain measures of proximity between convex polytopes: a complexity viewpoint
نویسندگان
چکیده
Four problems of proximity between two convex polytopes in R' are considered. The convex polytopes are represented as convex hulls of finite sets of points. Let the total number of points in the two finite sets be n. W e show that three of the proximity problems, viz., checking intersection, checking whether the polytopes are just touching and finding the distance between them, can be solved in O(n) time fo r fixed s and in polynomial t ime f o r va y i n g s . We also show that the fourth proximity problem of finding the intensity of collision f o r varying s is NP-complete.
منابع مشابه
Symmetrization procedures and convexity in centrally symmetric polytopes
Univariate symmetrization technique has many good properties. In this paper, we adopt the high-dimensional viewpoint, and propose a new symmetrization procedure in arbitrary (convex) polytopes of R with central symmetry. Moreover, the obtained results are used to extend to the arbitrary centrally symmetric polytopes the well-known Hermite-Hadamard inequality for convex functions.
متن کامل36 Computational Convexity
The subject of Computational Convexity draws its methods from discrete mathematics and convex geometry, and many of its problems from operations research, computer science, data analysis, physics, material science, and other applied areas. In essence, it is the study of the computational and algorithmic aspects of high-dimensional convex sets (especially polytopes), with a view to applying the ...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملNew best proximity point results in G-metric space
Best approximation results provide an approximate solution to the fixed point equation $Tx=x$, when the non-self mapping $T$ has no fixed point. In particular, a well-known best approximation theorem, due to Fan cite{5}, asserts that if $K$ is a nonempty compact convex subset of a Hausdorff locally convex topological vector space $E$ and $T:Krightarrow E$ is a continuous mapping, then there exi...
متن کاملExistence Results of best Proximity Pairs for a Certain Class of Noncyclic Mappings in Nonreflexive Banach Spaces Polynomials
Introduction Let be a nonempty subset of a normed linear space . A self-mapping is said to be nonexpansive provided that for all . In 1965, Browder showed that every nonexpansive self-mapping defined on a nonempty, bounded, closed and convex subset of a uniformly convex Banach space , has a fixed point. In the same year, Kirk generalized this existence result by using a geometric notion of ...
متن کامل